Conditional Median: A Parametric Solution Concept for Location Problems
نویسندگان
چکیده
Classical approaches to location problems are based on the minimization of the average distance (the median concept) or the minimization of the maximum distance (the center concept) to the service facilities. The median solution concept is primarily concerned with the spatial efficiency while the center concept is focused on the spatial equity. The k-centrum model unifies both the concepts by minimization of the sum of the k largest distances. In this paper we investigate a solution concept of the conditional median which is a generalization of the k-centrum concept taking into account the portion of demand related to the largest distances. Namely, for a specified portion (quantile) of demand we take into account the entire group of the corresponding largest distances and we minimize their average. It is shown that such an objective, similar to the standard minimax, may be modeled with a number of simple linear inequalities. Equitable properties of the solution concept are examined.
منابع مشابه
Lower semicontinuity for parametric set-valued vector equilibrium-like problems
A concept of weak $f$-property for a set-valued mapping is introduced, and then under some suitable assumptions, which do not involve any information about the solution set, the lower semicontinuity of the solution mapping to the parametric set-valued vector equilibrium-like problems are derived by using a density result and scalarization method, where the constraint set $K$...
متن کاملHölder continuity of solution maps to a parametric weak vector equilibrium problem
In this paper, by using a new concept of strong convexity, we obtain sufficient conditions for Holder continuity of the solution mapping for a parametric weak vector equilibrium problem in the case where the solution mapping is a general set-valued one. Without strong monotonicity assumptions, the Holder continuity for solution maps to parametric weak vector optimization problems is discussed.
متن کاملPERFORMANCE COMPARISON OF CBO AND ECBO FOR LOCATION FINDING PROBLEMS
The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...
متن کاملModels, solution, methods and their applicability of dynamic location problems (DLPs) (a gap analysis for further research)
Determining the best location to be profitable for the facility’s lifetime is the important decision of public and private firms, so this is why discussion about dynamic location problems (DLPs) is a critical significance. This paper presented a comprehensive review from 1968 up to most recent on published researches about DLPs and classified them into two parts. First, mathematical models deve...
متن کاملA Parametric Approach for a Nonlinear Discrete Location Problem
A discrete location problem is formulated for the design of a postal service network. The cost objective of this problem includes a nonlinear concave component. A parametric integer programming algorithm is developed to find an approximate solution to the problem. The algorithm reduces the problem into a sequence of p-median problems and deals with the nonlinear cost by a node-replacement schem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Annals OR
دوره 110 شماره
صفحات -
تاریخ انتشار 2002